Papers with Interval Bound Propagation
Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation (D19-1)
Copied to clipboard
Po-Sen Huang, Robert Stanforth, Johannes Welbl, Chris Dyer, Dani Yogatama, Sven Gowal, Krishnamurthy Dvijotham, Pushmeet Kohli
| Challenge: | Recent work has exposed the vulnerabilities of neural NLP models, e.g. with small, semantically invariant input alterations. |
| Approach: | They propose to model text classification under synonym replacements or character flip perturbations and then use a formal model verification method to verify its robustness. |
| Outcome: | The proposed models show little difference in terms of nominal accuracy, but have much improved verified accuracy under perturbations and come with an efficiently computable formal guarantee on worst case adversaries. |
Certified Robustness to Adversarial Word Substitutions (D19-1)
Copied to clipboard
| Challenge: | State-of-the-art NLP models can be fooled by adversaries that apply seemingly innocuous label-preserving transformations to input text. |
| Approach: | They propose to train models that are provably robust to all word substitutions in a family of label-preserving transformations that can be replaced with a similar word without changing the original sentiment. |
| Outcome: | The proposed models achieve 75% adversarial accuracy on both sentiment analysis and natural language inference on IMDB and SNLI compared to models trained normally and ones trained with data augmentation. |